public class TestDemo {
    /*
    class Solution {
    public int kthToLast(ListNode head, int k) {
        ListNode slow = head;
        ListNode fast = head;
        for (int i = 1;i <= k;i++) {
            fast = fast.next;
        }

        while (fast != null) {
            fast = fast.next;
            slow = slow.next;
        }
        return slow.val;
    }
}
     */

/*
class Solution {
    public ListNode deleteMiddle(ListNode head) {
        if (head.next == null) {
            return null;
        }
        ListNode slow = head;
        ListNode fast = head;
        ListNode SlowPrev = head;
        while (fast != null && fast.next != null) {
            fast = fast.next.next;
            SlowPrev = slow;
            slow = slow.next;
        }
        SlowPrev.next = slow.next;
        return head;
    }
}
 */

    /*
    class Solution {
    public boolean isPalindrome(ListNode head) {
        List<Integer> list = new ArrayList<Integer>();
        while(head != null){
            list.add(head.val);
            head = head.next;
        }
        int i = 0,j = list.size()-1;
        while(i<j){

              if(list.get(i) != list.get(j))return false;false
              i++;
              j--;
        }
        return true;
    }
}
     */

    /*
    public class Solution {
    public ListNode detectCycle(ListNode head) {
        ListNode fast = head;
        ListNode slow = head;
        while (fast != null && fast.next != null) {
            fast = fast.next.next;
            slow = slow.next;
            if( fast == slow) {
                break;
            }
        }
        if (fast == null || fast.next == null) {
            return null;
        }
        ListNode p = head;
        while (p != slow) {
            slow = slow.next;
            p = p.next;
        }
        return p;
    }
}
     */

    /*
    class Solution {
    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        ListNode cur = new ListNode(-1);
        ListNode head = cur;
        int carry = 0;
        while (l1 != null || l2 != null) {
            int numA = l1 != null ? l1.val : 0;
            int numB = l2 != null ? l2.val : 0;
            int sum = numA + numB + carry;
            carry = sum / 10;
            cur.next = new ListNode(sum % 10);
            cur = cur.next;
            if (l1 != null) {
                l1 = l1.next;
            }
            if (l2 != null) {
                l2 = l2.next;
            }
        }
        if (carry > 0) {
            cur.next = new ListNode(carry);
        }
        return head.next;
    }
}
     */

    public static void main(String[] args) {
        System.out.println("I'm a bit of lazy today eeeeeeeeeeeee.");
    }

}
